Routing Optimization for Forces Based on Traffic Matrix
نویسنده
چکیده
The research of the ForCES technology has made a great progress. However current research of ForCES mainly focuses on architecture and techniques. In order to ensure ForCES architecture network works well, it is significant to take account of routing optimization for ForCES architecture. In this paper, we will introduce the minimizing sum of path-cost model based on multiple traffic matrices to optimize the routing at FE sides in ForCES architecture. At last, through simulation experiment we prove that it achieves good results in routing optimization.
منابع مشابه
Energy optimization based on routing protocols in wireless sensor network
Considering the great significant role that routing protocols play in transfer rate and choosing the optimum path for exchange of data packages, and further in the amount of consumed energy in the routing protocol, the present study has focused on developing an efficient compound energy algorithm based on cluster structure which is called active node with cluster structure. The purpose of this ...
متن کاملResearch of the ForCES Routing Optimization
The research on For CES technology has made a great progress. However current researches on For CES mainly focus on architecture and techniques. In order to ensure For CES architecture network works well, it is significant to take account of performance (such as routing) optimization for For CES architecture. In this paper, we introduced a minimizing sum of path-cost model based on multiple tra...
متن کاملAnomaly detection and localization by diffusion wavelet-based analysis on traffic matrix
Diffusion wavelets (DW) transform has been successfully used in Multi-Resolution Analysis (MRA) of traffic matrices because it inherently adapts to the structure of the underlying network. There are many potential applications based on DW analysis such as anomaly detection, routing optimization and capacity plan, which, however, have not been well developed. This paper shows how to apply two-di...
متن کاملA Comparison of NSGA II and MOSA for Solving Multi-depots Time-dependent Vehicle Routing Problem with Heterogeneous Fleet
Time-dependent Vehicle Routing Problem is one of the most applicable but least-studied variants of routing and scheduling problems. In this paper, a novel mathematical formulation of time-dependent vehicle routing problems with heterogeneous fleet, hard time widows and multiple depots, is proposed. To deal with the traffic congestions, we also considered that the vehicles are not forced to come...
متن کاملNon-convex Optimization in Internet Routing: Protocol, Formulation, and Computation
Network operators control the flow of traffic through their networks by adapting the configuration of the underlying routing protocols. For example, they tune the integer link weights that routing protocols like OSPF use to do distributed forwarding of packets. The resulting optimization problem by the operator—to find the best link weights for a given topology and traffic matrix—is well-known ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012